Reverse Combinatorial Auctions for Resource Allocation in the Rescue Scenario
نویسندگان
چکیده
In a disaster environment no single agent knows the disaster situation completely. So, rescue agents share their information in order to identify rescue tasks that are then allocated. In this paper we model the allocation problem as a reverse combinatorial auction and we apply some existing algorithms to solve it. Our results have been compared with the RoboCup classification of 2005.
منابع مشابه
Winner Determination in Combinatorial Auctions using Hybrid Ant Colony Optimization and Multi-Neighborhood Local Search
A combinatorial auction is an auction where the bidders have the choice to bid on bundles of items. The WDP in combinatorial auctions is the problem of finding winning bids that maximize the auctioneer’s revenue under the constraint that each item can be allocated to at most one bidder. The WDP is known as an NP-hard problem with practical applications like electronic commerce, production manag...
متن کاملDevelopment of a Genetic Algorithm for Advertising Time Allocation Problems
Commercial advertising is the main source of income for TV channels and allocation of advertising time slots for maximizing broadcasting revenues is the major problem faced by TV channel planners. In this paper, the problem of scheduling advertisements on prime-time of a TV channel is considered. The problem is formulated as a multi-unit combinatorial auction based mathematical model. This is a...
متن کاملAn adaptive bidding strategy for combinatorial auctions-based resource allocation in dynamic markets
Combinatorial auctions, where bidders are allowed to submit bids for bundles of items, are preferred to single-item auctions when bidders have complementarities and substitutabilities among items and therefore achieve better social efficiency. A large unexplored area of research is the design of bidding strategies. In this paper, we propose a new adaptive bidding strategy for combinatorial auct...
متن کاملPrice controlled resource allocation for the provision of information products and services employing combinatorial auctions
Abstract The dynamic allocation of resources for the supply of Information Services and Information Products (ISIP) is of increasing importance for infrastructure and service providers in growing B2B and B2C markets. Based on the FIPA oriented Multi Agent System (MAS) platform JADE we developed a model which simulates the allocation of ISIP resources by a Combinatorial Auction (CA). An Improved...
متن کاملEffects of Approximation on an Iterative Combinatorial Auction
HARISH G KAMMANAHALLI. Effects of Approximation on an Iterative Combinatorial Auction. (Under the direction of Dr Ṗeter Wurman.) Combinatorial auctions are a promising way of solving the complicated heterogeneous resource allocation problem. However combinatorial auctions present inherently hard computational problems for agents and auctioneers. In particular (1) the auction must solve the winn...
متن کامل